منابع مشابه
Intersection Matrices Revisited
Several intersection matrices of s-subsets versus k-subsets of a v-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known identities appear as natural consequences of this viewpoint; especially, use of the derivative operator d/dz and some related operators reveals some connections betw...
متن کاملDynamic Set Intersection
Consider the problem of maintaining a family F of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given S, S′ ∈ F , report every member of S ∩S′ in any order. We show that in the word RAM model, where w is the word size, given a cap d on the maximum size of any set, we can support set intersection queries in O( d w/ log2 w ) expected time, and updates in O...
متن کاملSet Constraints with Intersection
Set constraints are inclusions between expressions denoting sets of trees. The eficiency of their satisfiabili ty test is a central issue in set-based program analysis, their main application domain. W e introduce the class of set constraints with intersection (the only operators forming the expressions are constructors and intersection) and show that i ts satisfiability problem as DEXPTIME-com...
متن کاملStill Another Rank Determination of Set Intersection Matrices with an Application in Communication Complexity
The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in 4] and 5]. In this note, the rank of these matrices is determined by another method of proof, which makes use of a factorization into a produ...
متن کاملGUC-Secure Set-Intersection Computation
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party set-intersection computation based-on anonymous IBE (identity-based encryption) scheme and its user private-keys blind generation techniques. Compared with related works, this construction is provably GUC(generalized un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1982
ISSN: 0097-3165
DOI: 10.1016/0097-3165(82)90018-8